The Covering Problem for Chinese Rings
نویسنده
چکیده
Given a direct sum G of cyclic groups, we find a sharp bound for the minimal number of proper subgroups whose union is G. This generalizes to sums of cyclic modules over more general rings, and we are able to solve this covering problem for all local, Artinian, or Dedekind rings (and even for monoids). We also minimally cover all finitely generated non-cyclic modules over quasi-local rings. These and related questions have been the subject of much past study, but only for finite groups. Our methods differ from those found in the literature, and make it possible to work in the general setting of Chinese rings, which generalize the Chinese Remainder Theorem (and include the above cases). We also address a related problem: given a finite set M that is a direct sum of cyclic R-modules, and a distinguished element m ∈ M , what is the smallest number of cosets of proper R-submodules whose union is M \ {m}? When R = Z, this question is related to various conjectures in the literature.
منابع مشابه
General form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملDynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملMathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters
The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...
متن کامل